Rationalizability of choice functions by game trees
نویسندگان
چکیده
Collective choices are often cyclic and cannot be rationalized by a well-defined linear ordering. In this paper we identify conditions under which collective choices, potentially cyclic, can be rationalized by extensive games with perfect information. JEL Classification Numbers: C70, D70
منابع مشابه
Centre de Referència en Economia Analítica
A choice function is sequentially rationalizable if there is an ordered collection of asymmetric binary relations that identifies the selected alternative in every choice problem. We propose a property, F-consistency, and show that it characterizes the notion of sequential rationalizability. F-consistency is a testable property that highlights the behavioral aspects implicit in sequentially rat...
متن کاملChoice by sequential procedures
We propose a rule of decision-making, the sequential procedure guided by routes, and show that three influential boundedly rational choice models can be equivalently understood as special cases of this rule. In addition, the sequential procedure guided by routes is instrumental in showing that the three models are intimately related. We show that choice with a status-quo bias is a refinement of...
متن کاملProper belief revision and rationalizability in dynamic games
In this paper we develop an epistemic model for dynamic games in which players may revise their beliefs about the opponents’ utility functions as the game proceeds. Within this framework, we propose a rationalizability concept that is based upon the following three principles: (1) at every instance of the game, a player should believe that his opponents are carrying out optimal strategies, (2) ...
متن کامل14.126 Lecture 9: Rationalizability and correlated equilibrium
When we define a game we implicitly assume that the structure (i.e. the set of players, their strategy sets and the fact that they try to maximize the expected value of the von-Neumann and Morgenstern utility functions) described by the game is common knowledge. The exact implications of this implicit assumption is captured by rationalizability. In this lecture, I will formally demonstrate this...
متن کاملRationalizability of choice functions on general domains without full transitivity
The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity. We describe the logical relationships between the different notions of rationalizability involving, for example, the transitivity, quasi-transitivity, or acyclicity of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 134 شماره
صفحات -
تاریخ انتشار 2007